The Degrees of Maximality of the Intuitionistic Propositional Logic and of Some of Its Fragments
ثبت نشده
چکیده
Professor Ryszard Wójcicki once asked whether the degree of maxi-mality of the consequence operation C determined by the theorems of the intuitionistic propositional logic and the detachment rule for the implication connective is equal to 2 2 ℵ 0 ? The aim of the paper is to give the affirmative answer to the question. More exactly, it is proved here that the degree of maximality of C Ψ-the Ψ-fragment of C, is equal to 2 2 ℵ 0 , for every Ψ ⊆ {→, ∧, ∨, ¬} such that →∈ Ψ. ¿From now an Ψ stands for a subset of {→, ∧, ∨, ¬} such that →∈ Ψ, F Ψ = (F Ψ , Ψ) for the absolutely free algebra determined by Ψ via infinite but denumerable set V of variables, and C Ψ denotes the consequence operation in F Ψ (see [4]) determined by the detachment rule for the implication connective together with all rules of the form r(∅, α) where α ranges over all theorems of the intuitionistic propositional logic which contain only connectives from the set Ψ. For Ψ = {→, ∧, ∨, ¬} instead of C Ψ we write C. Observe that the Waisberg separation theorem yields:
منابع مشابه
Truth Values and Connectives in Some Non-Classical Logics
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...
متن کاملAN ALGEBRAIC STRUCTURE FOR INTUITIONISTIC FUZZY LOGIC
In this paper we extend the notion of degrees of membership and non-membership of intuitionistic fuzzy sets to lattices and introduce a residuated lattice with appropriate operations to serve as semantics of intuitionistic fuzzy logic. It would be a step forward to find an algebraic counterpart for intuitionistic fuzzy logic. We give the main properties of the operations defined and prove som...
متن کاملEquality propositional logic and its extensions
We introduce a new formal logic, called equality propositional logic. It has two basic connectives, $boldsymbol{wedge}$ (conjunction) and $equiv$ (equivalence). Moreover, the $Rightarrow$ (implication) connective can be derived as $ARightarrow B:=(Aboldsymbol{wedge}B)equiv A$. We formulate the equality propositional logic and demonstrate that the resulting logic has reasonable properties such a...
متن کاملExplorations and computations in bidirectional intuitionistic propositional logic
This paper investigates the semantics of the intuitionistic propositional logic (IPL) extended with subtraction, also known as the HeytingBrouwer logic or biIPL. It introduces and extends some basic concepts and theorems in the Kripke semantics of intuitionistic propositional logic to obtain new results on the exact models of fragments in the bidirectional case. The paper also includes results ...
متن کاملIntuitionistic fuzzy logic for adaptive energy efficient routing in mobile ad-hoc networks
In recent years, mobile ad-hoc networks have been used widely due to advances in wireless technology. These networks are formed in any environment that is needed without a fixed infrastructure or centralized management. Mobile ad-hoc networks have some characteristics and advantages such as wireless medium access, multi-hop routing, low cost development, dynamic topology and etc. In these netwo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010